Method of estimating crosstalk noise in lumped RLC coupled interconnects

ABSTRACT

A method for efficiently estimating crosstalk noise of high-speed VLSI interconnects is provided. In the invention, high-speed VLSI interconnects are modeled as lumped RLC coupled trees. The inductive crosstalk noise waveform can be accurately estimated in an efficient manner using the linear time moment computation technique in conjunction with the projection-based order reduction method. Recursive formulas of moment computations for coupled RC trees are derived with considering both self inductances and mutual inductances. Also, analytical formulas of voltage moments at each node will be derived explicitly. These formulas can be efficiently implemented for crosstalk estimations.

BACKGROUND OF THE INVENTION

1. Field of the Invention

The present invention relates to a method of estimating crosstalk noise in high-speed VLSI interconnects, and more particularly, to a method of using moment computations of lumped coupled RLC-tree models and project-based model-order reduction techniques.

2. Description of Related Art

Modern technological trends have caused interconnect modeling to have attracted considerable attention in high-speed VLSI designs. Owing to these designs with performance considerations, increasing clock frequency, shorter rising times, higher density of wires, and using low-resistivity materials, on-chip inductance effects can no longer be ignored in interconnect models. Furthermore, the importance of coupling inductance effects has grown continuously since nanometer technology has emerged over the last few years. It has been observed that crosstalk noise estimations made by considering inductance effects may yield more pessimistic results than those made without considering coupling inductance effects, as discussed in C. K. Cheng, J. Lillis, S. Lin, and N. H. Chang, Interconnect Analysis and Synthesis, John Wiley and Sons Inc., 2000. Such estimation errors follow from two main reasons: (1) more and longer wires in parallel increase the capacitive coupling, leading to large current changes on the victim nets. (2) increasing self inductance worsens overshooting spikes on aggressor nets. It may then pull the victims with them. For the above practical considerations, interconnect models shall be extended to be coupled RLC trees while considering the inductance effects.

A common means of estimating crosstalk noise is implemented by simulating circuit-level VLSI interconnects. Although the results are very accurate, the computational complexity is excessive, especially for large-scale interconnect simulations. An alternative approach, called model-order reduction methods, has recently emerged to solve the problem, as disclosed in L. T. Pillage and R. A. Rohrer, “Asymptotic waveform evaluation for timing analysis,” IEEE Trans. Computer-Aided Design, vol. 9, no. 4, pp. 352-366, 1990; P. Feldmann and R. W. Freund, “Efficient linear circuit analysis by Pade approximation via the Lanczos process,” IEEE Trans. Computer-Aided Design, vol. 14, no. 5, 1995, and A. Odabasioglu, M. Celik, and L. T. Pileggi, “PRIMA: passive reduced-order interconnect macromodeling algorithm,” IEEE Trans. Computer-Aided Design, vol. 17, no. 8, pp. 645-653, 1998. Then, rather than directly estimating the crosstalk waveform of the original interconnects, the crosstalk noise of the reduced-order system is estimated. However, the computational cost is still too high for a noise optimization problem even though model-order reduction methods have reduced the cost, as disclosed in A. Devgan, “Efficient coupled noise estimatin for on-chip interconnects,” in Porc. ICCAD, 1997, pp. 147-151; M. Kuhlmann and S. S. Sapatnekar, “Exact and efficient crosstalk estimation,” IEEE Trans. Computer-Aided Design, vol. 20, no. 7, pp. 858-866, 2001.

A consensus has emerged that of many model-order reduction techniques, the moment matching approach seems to be the most viable for estimating interconnect crosstalk noise. For computational efficiency, traditional models for estimating noise in coupled RC trees have been developed, including the one-pole model (1P) (as disclosed in A. Vittal, L. H. Chen, M. Marek-Sadowska, K. P. Wang, and S. Yang, “Crosstalk in VLSI interconnects,” IEEE Trans. Computer-Aided Design, vol. 18, pp. 1817-1824, 1999; and A. Vittal and M. Marek-Sadowska, “Crosstalk reduction for VLSI,” IEEE Trans. Computer-Aided Design, vol. 16, pp. 290-298, 1997), the modified one-pole model (M1P) (as disclosed in Q. Yu and E. S. Kuh, “Moment computation of lumped and distributed coupled RC trees with application to delay and crosstalk estimation,” Proceedings of the IEEE, vol. 89, no. 5, pp. 772-788, 2001), the two-pole model (2P) (as discussed in M. Kuhlmann and S. S. Sapatnekar, “Exact and efficient crosstalk estimation,” IEEE Trans. Computer-Aided Design, vol. 20, no. 7, pp. 858-866, 2001; and Q. Yu and E. S. Kuh, “Moment computation of lumped and distributed coupled RC trees with application to delay and crosstalk estimation,” Proceedings of the IEEE, vol. 89, no. 5, pp. 772-788, 2001), (as disclosed in E. Acar, A. Odabasioglu, M. Celik, and L. T. Pileggi, “S2P: A stable 2-pole RC delay and coupling noise metric,” in Proc. 9th Great Lakes Symp. VLSI, March 1999, pp. 60-63), and the guaranteed stable three-pole model (S3P) (as discussed in Q. Yu and E. S. Kuh, “Moment computation of lumped and distributed coupled RC trees with application to delay and crosstalk estimation,” Proceedings of the IEEE, vol. 89, no. 5, pp. 772-788, 2001). Unlike the general model-order reduction methods, the techniques simply estimate the peak value of crosstalk noise and the time at which it peaks rather than evaluating the waveform of crosstalk noise. Also, other patents U.S. Pat. No. 5,481,695, U.S. Pat. No. 5,535,133, U.S. Pat. No. 5,555,506, U.S. Pat. No. 5,568,395, U.S. Pat. No. 5,596,506, U.S. Pat. No. 6,018,623, U.S. Pat. No. 6,029,117, and U.S. Pat. No. 6,405,348 have been disclosed the techniques about the crosstalk noise estimations. However, since the interconnect crosstalk noise may have a non-monotonic response waveform, these models seem to be unsuitable for capturing the essential nature of such crosstalk noise.

Recently, the delay and noise formulae by considering self inductances and mutual inductances have been disclosed in Y. Cao, X. Huang, D. Sylvester, N. Chang, and C. Hu, “A new analytical delay and noise model for on-chip RLC interconnect,” in Proc. IEDM 2000, 2000, pp. 823-826. However, their model is restricted to two parallel lines. The analytical delay and overshooting formulae for coupled RLC lines have been disclosed in M. H. Chowdhury, Y. I. Ismail, C. V. Kashyap, and B. L. Krauter, “Performance analysis of deep sub micron VLSI circuits in the presence of self and mutual inductance,” in Proc. ISCAS 2002, 2002, pp. 197-200. However, issues concerning inductive crosstalk noise analysis have still not yet been studied. Furthermore, by exploring the special nature of RLC-tree structures, recursive algorithms for computing system moments with linear order have been developed, for example, by C. L. Ratzlaff and L. T. Pillage, “RICE: rapid interconnect circuit evaluation using AWE,” IEEE Trans. Computer-Aided Design, vol. 13, no. 6, pp. 763-776, 1994 and Q. Yu and E. S. Kuh, “Exact moment matching model of transmission lines and application to interconnect delay estimation,” IEEE Trans. VLSI syst., vol. 3, no. 2, pp. 311-322, 1995, independently. Moment models of general transmission lines were presented in Q. Yu, E. S. Kuh, and T. Xue, “Moment models of general transmission lines with application to interconnect analysis and optimization,” IEEE Trans. VLSI syst., vol. 4, no. 4, pp. 477-494, 1996. However, these studies did not mention moment computations for coupled RLC trees.

The technique, “Crosstalk estimated in high-speed VLSI interconnect using coupled RLC-tree models”, which is proposed in Proc. 2002 IEEE Asia Pacific Conference on Circuits and Systems, is our initial research. Although the moment computation formulae for coupled RLC trees have been developed, the technique about efficiently constructing the crosstalk estimation model was not provided. Also, the stability of the model was still not analyzed.

SUMMARY OF THE INVENTION

The present invention discloses a method for efficiently estimating crosstalk noise of high-speed VLSI interconnects. In the invention, high-speed VLSI interconnects are modeled as RLC coupled trees. The inductive crosstalk noise waveform can be accurately estimated in an efficient manner using the linear time recursive moment computation technique in conjunction with the projection-based order reduction method. Recursive formulas of moment computations for coupled RC trees are derived with considering both self inductances and mutual inductances.

The present invention discloses a method for efficiently estimating crosstalk noise of high-speed VLSI interconnects. In the invention, high-speed VLSI interconnects are modeled as RLC coupled trees. The inductive crosstalk noise waveform can be accurately estimated in an efficient manner using the linear time recursive moment computation technique in conjunction with the projection-based order reduction method. Recursive formulas of moment computations for coupled RC trees are derived with considering both self inductances and mutual inductances.

Further benefits and advantages of the present invention will become apparent after a careful reading of the detailed description with appropriate reference to the accompanying drawings.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 represents a flow chart of the method of estimating crosstalk noise in lumped RLC coupled interconnects in accordance with the present invention;

FIG. 2 is an illustration of a typical section of tree T^(i) in coupled RLC trees;

FIG. 3 illustrates the moment model of two capacitive coupled nodes: (a) original circuit model; (b) equivalent moment model;

FIG. 4 illustrates the moment model of two coupled R-L branches: (a) original circuit model. (b) equivalent moment model;

FIG. 5 represents the recursive moment computation algorithm for lumped coupled RLC trees; and

FIG. 6 illustrates three types of coupled RLC trees: (a) two lines (b) tree 1 (c) tree 2, wherein the lengths of the coupling lines of net 1 belong to the set L1={1, 2, 3, 4, 5} (mm) and those of net 2 are also in the set L2={1, 2, 3, 4, 5} (mm), and the latter are never longer than the former.

DETAILED DESCRIPTION OF THE INVENTION

FIG. 1 shows the flow chart of the crosstalk estimation algorithm in the disclosed invention. Three input files should be included, which contain input signal 10, circuit parameters of the lumped coupled RLC trees 12, and the order q of the reduced-order model 14. Initially, in step 16, calculate q-order moments {X₁, X₂, . . . , X_(q)}. Then, in step 18, construct q-order reduced-order MNA matrices {circumflex over (M)} and {circumflex over (N)}. In step 20, calculate the coefficients {b₁, b₂, b_(q)} of the equation |{circumflex over (N)}+s{circumflex over (M)}|=1+b₁s+b₂s²+ . . . +b_(q)s^(q). Step 22 updates the values of the moments according to the input signal. Step 24 calculates the coefficients {a₀, a₁, a_(q−2)} of the transfer function of the qth-order reduced-order model ${\hat{V}(s)} = \frac{a_{0} + {a_{1}s} + \ldots + {a_{q - 2}s^{q - 1}}}{1 + {b_{1}s} + \ldots + {b_{q - 1}s^{q - 1}} + {b_{q}s^{q}}}$ by using the moments obtained in step 22. Then {circumflex over (V)}(s) is reformulated by the pole-residue form ${\hat{V}(s)} = {\frac{k_{1}}{s - p_{1}} + \frac{k_{2}}{s - p_{2}} + \ldots + \frac{k_{q}}{s - p_{q}}}$ and the resultant time-domain crosstalk noise will be {circumflex over (v)}(t)=k₁e^(p) ¹ ^(t)+k₂e^(p) ^(q) ^(r)+ . . . +k_(q)e^(p) ^(q) ^(t) by applying the inverse Laplace transform in step 26. Finally, step 28 estimates the peak value the crosstalk noise and the algorithm is terminated in step 30.

The dynamics of RLC coupled trees can also be represented by the following MNA formula: $\begin{matrix} {{{\left( {{s\underset{\underset{M}{︸}}{\begin{bmatrix} C & 0 \\ 0 & L \end{bmatrix}}} + \underset{\underset{N}{︸}}{\begin{bmatrix} G & E \\ {- E^{T}} & R \end{bmatrix}}} \right)\underset{\underset{X{(s)}}{︸}}{\begin{bmatrix} {V(s)} \\ {I(s)} \end{bmatrix}}} = B}{{{Y(s)} = {P^{T}{X(s)}}},}} & (1) \end{matrix}$ where M,NεR^(n×n), BεR^(n×m), and PεR^(n×p), The matrix M contains the capacitance matrix C and the inductance matrix L; the matrix N comprises the conductance matrix G and the resistance matrix R and the incident matrix E. The matrix X(s) represents the transfer functions of the state variables. The matrix B=[b₁ b₂ . . . b_(m)] indicates that the circuit has m aggressor trees and each b_(i)(1≦i≦m) represents the contribution of the ith independent voltage source. V(s)εR^((n/2)×m) denotes voltages across the grounding capacitances and I(s)εR^((n/2)×m) contains currents flowing through R-L branches of the aggressor and victim trees. Since the number of nodes and that of R-L branches are equal, n/2 is a positive integer number. Y(s) stands for the transfer functions at the far end nodes of the victim trees chosen from X(s) by P. For simplicity, it is assumed that the circuit has only one aggressor tree and once a victim tree is concerned, m=p=1.

If we expand X(s) in power series, X(s)=Σ_(i)X_(i)s^(i), the ith-order moment of X(s) about s=0, X_(i), can be obtained. With the aid of Eq. (1), the recursive formula for moment X_(i) can be established as follows: NX ₀ =B NX _(i+1) =−MX _(i), for i=0, 1, . . . , q  (2)

In particular, for special lumped RLC-tree structures, efficient recursive moment computation formulae are disclosed in the invention to neglect the above expensive matrix computations. The details will be shown as follows.

Moment Computations for Lumped Coupled RLC-Tree Interconnect Models

A set of coupled RLC trees contains several individual RLC trees with capacitive and inductive couplings to each other. Each RLC tree comprises floating resistors and self inductors from the ground and capacitors connecting between nodes on the tree and the ground. A lumped RLC-tree model excludes transmission lines, couplings, and resistor loops. Each transmission line should be approximated by lumped RLC circuits with a sufficiently large number of RLC segments. A tree with a voltage source connected to its root is called an aggressor tree; by contrast, trees whose roots are grounding are called victim trees. By ignoring self inductances and mutual inductances, the conventional coupled RC-tree models are obtained. In this invention, coupled interconnects are modeled as coupled RLC trees for analyzing the crosstalk noises.

To clearly describe the complex coupled RLC-tree structures, the invention first introduce the notations. Consider a typical section of tree T^(i) in coupled RLC trees shown in FIG. 2, where n_(j) ^(i) is the j th node in the tree T^(i) and F(n_(j) ^(i)) is the corresponding father node of n_(j) ^(i). Node n₀ ^(i) is the root of T^(i) and F(n₀ ^(i))=φ. N^(i) is the set of the non-root nodes in T^(i). S(n_(j) ^(i)) denotes the set of the son nodes of n_(j) ^(i).

Each root node has only one son node. R_(j) ^(i) and L_(j) ^(i) are the resistance and the inductance connected between n_(j) ^(i) and F(n_(j) ^(i)); C_(j,0) ^(i) is the capacitance connected between n_(j) ^(i) and the ground. C_(j, j₁)^(i, i₁) denotes the coupling capacitance between n_(j) ^(i) and n_(j) ₁ ^(i) ¹ ; M_(j,j) ₁ ^(i,i) ¹ is the mutual inductance between L_(j) ^(i) and L_(j) ₁ ^(i) ¹ . CC_(j) ^(i) denotes the set of coupling capacitances connected to n_(j) ^(i); MM_(j) ^(i) is the set of mutual inductances coupled to L_(j) ^(i). In general, the coupling effect, especially with inductive couplings, is not restricted to arising between two closest neighbors. Therefore, the proposed method will address the comprehensive circumstances that each set CC_(j) ^(i) and MM_(j) ^(i) may include several coupling capacitances and mutual inductances. P_(jk) ^(i) is defined as the common path of the path P_(j) ^(i) from n_(j) ^(i) to the root of T^(i) and of the path P_(k) ^(i) from n_(k) ^(i) to the root of T^(i). The total resistance R_(jk) ^(i) and the total inductance L_(jk) ^(i) along the path P_(jk) ^(i) are defined as the sum of the resistances and the sum of the self inductances along the path P_(jk) ^(i). Namely, R_(jk) ^(i)=Σ_(n) _(j) _(i) _(εP) _(jk) _(i) R_(j) ^(i) and L_(jk) ^(i)=Σ_(n) _(j) _(i) _(εP) _(jk) _(i) L_(j) ^(i). The total capacitance C_(jT) ^(i) at the node n_(j) ^(i) is defined as the sum of capacitances connected to the node n_(j) ^(i), that is, C_(jT) ^(i)=C_(j,0) ^(i)+Σ_(C) _(j,j1) _(i,i1) _(εCC) _(j) _(i) C_(j,j) ₁ ^(j,j) ¹ . The set of ancestor nodes of n_(j) ^(i), defined as A(n_(j) ^(i)), covers the nodes on the path P_(F(j)) ^(i) from F(n_(j) ^(i)) to the root of T^(i). Let Â(n_(j) ^(i))={{A(n_(j) ^(i))−n_(o) ^(i)}∪n_(j) ^(i)}. Conversely, D(n_(j) ^(i))={n_(x) ^(i)|n_(j) ^(i)εA(n_(x) ^(i))} denotes the set of descendant nodes of n_(j) ^(i). We also define {circumflex over (D)}(n_(j) ^(i))={n_(j) ^(i)∪D(n_(j) ^(i))}. The shortest path length through couplings from the aggressor tree is denoted as d_(i), called the depth of tree T^(i). For example, if T^(i) ¹ is the aggressor tree in FIG. 2, then depth d_(i)=1 and depth d_(i) ₂ =2.

Let V_(j) ^(i)(s) be the transfer function of the voltage at node n_(j) ^(i) and I_(j) ^(i)(s) be the one of the current flowing through R_(j) ^(i). In particular, V₀ ^(i)(s) represents the voltage at root n₀ ^(i), where V₀ ^(i)(s)=1 means that a voltage source connected between n₀ ^(i) and the ground and otherwise V₀ ^(i)(s)=0. By expanding V_(j) ^(i)(s) and I_(j) ^(i)(s) in power series, we have ${V_{j}^{i}(s)} = {{\sum\limits_{k = 0}^{\infty}{V_{j,k}^{i}s^{k}\quad{and}\quad{I_{j}^{i}(s)}}} = {\sum\limits_{k = 0}^{\infty}{I_{j,k}^{i}{s^{k}.}}}}$ V_(j,k) ^(i) is called the kth-order voltage moment of V_(j) ^(i)(s) and I_(j,k) ^(i) is called the kth-order current moment of I_(j) ^(i)(s). The conventional Elmore delay of n_(j) ^(i) is defined as the first-order voltage moment −V_(j,1) ^(i). The aim of this section is to compute moments V_(j,k) ^(i) and I_(j,k) ^(i) for each node n_(j) ^(i) with a given order k.

For a capacitor C, owing to a capacitive current I_(C)(s)=sCV(s), its zeroth-order current moment I_(C,0) is equal to zero and the kth-order (k>0) current moment I_(C,k)=CV_(k−1). This implies that the capacitor is equivalent to an open circuit if k=0 or otherwise a current source. For example, consider the circuit with two grounding capacitors and a coupling capacitor in FIG. 3. For k>0, the currents leaving n_(j) ^(i) and n_(j) ^(i) through capacitors are equal to the following equations: $\begin{matrix} {I_{C_{j,k}}^{i} = {{\left( {C_{j,0}^{i} + C_{j,j_{1}}^{i,i_{1}}} \right)V_{j,{k - 1}}^{i}} - {C_{j,j_{1}}^{i,i_{1}}V_{j_{1},{k - 1}}^{i_{1}}}}} & (3) \\ {I_{C_{j_{1},k}}^{i_{1}} = {{\left( {C_{j_{1},0}^{i_{1}} + C_{j,j_{1}}^{i,i_{1}}} \right)V_{j_{1},{k - 1}}^{i_{1}}} - {C_{j,j_{1}}^{i,i_{1}}{V_{j_{1},{k - 1}}^{i_{1}}.}}}} & (4) \end{matrix}$

As a result, the coupling capacitor can be interpreted as two moment current sources. With extensions to multiple coupling capacitors, each decoupled current moment model can be derived as $\begin{matrix} {I_{C_{j,k}}^{i} = {{C_{jT}^{i}V_{j,{k - 1}}^{i}} - {\sum\limits_{C_{j,j_{1}}^{i,i_{1}} \in {CC}_{j}^{i}}{C_{j,j_{1}}^{i,i_{1}}V_{j_{1},{k - 1}}^{i_{1}}}}}} & (5) \end{matrix}$

The kth-order current moment I_(j,k) ^(i) can be obtained by summing up all of the downstream kth-order capacitive current sources: $\begin{matrix} {I_{j,k}^{i} = {\sum\limits_{n_{x}^{i} \in {D{(n_{j}^{i})}}}I_{C_{x,k}}^{i}}} & (6) \end{matrix}$

In particular, k=0 implies the zero dc current case. The Zeroth-order voltage moment V_(j,0) ^(i) at each node n_(j) ^(i) is equal to moment V_(0,0) ^(i) at the root node.

In contrast to the moment model of a capacitor, a self inductor L behaves as a short circuit or a voltage source. Suppose that V_(L)(s)=sLI(s). Then V_(L,0)=0 and V_(L,k)=LI_(k−1) for k>0. Referring to the two coupled R-L branches illustrated in FIG. 4, we have the following V-I characteristic relation: V_(F(j))^(i)(s) = V_(j)^(i)(s) + (R_(j)^(i) + sL_(j)^(i))I_(j)^(i)(s) + sM_(j, j₁)^(i, i₁)I_(j₁)^(i₁)(s), V_(F(j₁))^(i)(s) = V_(j₁)^(i₁)(s) + (R_(j₁)^(i₁) + sL_(j₁)^(i₁))I_(j₁)^(i₁)(s) + sM_(j, j₁)^(i, i₁)I_(j)^(i)(s).

By expanding each voltage and current about s=0 and collecting the coefficients of s^(k), the kth-order voltage moments can be obtained: V_(F(j), k)^(i) = V_(j, k)^(i) + R_(j)^(i)I_(j, k)^(i) + L_(j)^(i)I_(j, k − 1)^(i) + M_(j, j₁)^(i, i₁)I_(j₁, k − 1)^(i₁), V_(F(j₁), k)^(i₁) = V_(j₁, k)^(i₁) + R_(j₁)^(i₁)I_(j₁, k)^(i₁) + L_(j₁)^(i₁)I_(j₁, k − 1)^(i₁) + M_(j, j₁)^(i, i₁)I_(j, k − 1)^(i). as shown in FIG. 4(b). Also, the mutual inductor is decoupled and equivalent to two voltage sources on tree T^(i) and T^(i) ¹ . Extensions to multiple mutual inductors are also possible. In this case, each V_(F(j),k) ^(i) can be rewritten as $\begin{matrix} {V_{{F{(j)}},k}^{i} = {V_{j,k}^{i} + {R_{j}^{i}I_{j,k}^{i}} + {L_{j}^{i}I_{j,{k - 1}}^{i}} + {\sum\limits_{M_{j,j_{1}}^{i,i_{1}} \in {MM}_{j}^{i}}{M_{j,j_{1}}^{i,i_{1}}{I_{j_{1},{k - 1}}^{i_{1}}.}}}}} & (7) \end{matrix}$

By repeatedly substituting Eq. (7) upstream, the kth-order (k>0) moment V_(j,k) ^(i) of the non-root voltage V_(j) ^(i)(s) (j≠0) can be obtained as follows: $\begin{matrix} {V_{j,k}^{i} = {- {\underset{n_{r}^{i} \in {A{(n_{j}^{i})}}}{\sum\quad}{\left( {{R_{r}^{i}I_{r,k}^{i}} + {L_{r}^{i}I_{r,{k - 1}}^{i}} + {\sum\limits_{M_{r,r_{1}}^{i,i_{1}} \in {MM}_{r}^{i}}{M_{r,r_{1}}^{i,i_{1}}I_{r_{1},{k - 1}}^{i_{1}}}}} \right).}}}} & (8) \end{matrix}$

If the common path P_(pj) ^(i) between nodes n_(p) ^(i) and n_(j) ^(i) is concerned for each n_(p) ^(i)εN^(i), the above equation can be rewritten as $\begin{matrix} {V_{j,k}^{i} = {{{- \underset{n_{p}^{i} \in N^{i}}{\sum\quad}}\left( {{R_{pj}^{i}I_{C_{p,k}}^{i}} + {L_{pj}^{i}I_{C_{p,{k - 1}}}^{i}}} \right)} - \quad{\underset{n_{r}^{i} \in {A{(n_{j}^{i})}}}{\sum\quad}\underset{M_{r,r_{1}}^{i,i_{1}} \in {MM}_{r}^{i}}{\sum\quad}M_{r,r_{1}}^{i,i_{1}}{I_{r_{1},{k - 1}}^{i_{1}}.}}}} & (9) \end{matrix}$

As a result, the analytical formula for voltage moments at each node can be established as follows: $\begin{matrix} {{{V_{j,k}^{i} = {V_{{RC}_{j,k}}^{i} + V_{{LC}_{j,k}}^{i} + V_{{MC}_{j,k}}^{i}}},{where}}{V_{{RC}_{j,k}}^{i} = {{- \underset{n_{p}^{i} \in N^{i}}{\sum\quad}}{R_{pj}^{i}\left( {{C_{pT}^{i}V_{p,{k - 1}}^{i}} - {\sum\limits_{C_{p,p_{1}}^{i,i_{1}} \in {CC}_{p}^{i}}{C_{p,p_{1}}^{i,i_{1}}V_{p_{1},{k - 1}}^{i_{1}}}}} \right)}}}{V_{{LC}_{j,k}}^{i} = {{- \underset{n_{p}^{i} \in N^{i}}{\sum\quad}}{L_{pj}^{i}\left( {{C_{pT}^{i}V_{p,{k - 2}}^{i}} - {\sum\limits_{C_{p,p_{1}}^{i,i_{1}} \in {CC}_{p}^{i}}{C_{p,p_{1}}^{i,i_{1}}V_{p_{1},{k - 2}}^{i_{1}}}}} \right)}}}{{V_{{MC}_{j,k}}^{i} = {{- \underset{n_{r}^{i} \in {A{(n_{j}^{i})}}}{\sum\quad}}\underset{M_{r,r_{1}}^{i,i_{1}} \in {MM}_{r}^{i}}{\sum\quad}{M_{r,r_{1}}^{i,i_{1}}\left\lbrack {\underset{n_{x_{1}}^{i_{1}} \in {D{(n_{r_{1}}^{i_{1}})}}}{\sum\quad}\left( {{C_{x_{1}T}^{i_{1}}V_{x_{1},{k - 2}}^{i_{1}}} - {\sum\limits_{C_{x_{1},x_{2}}^{i_{1},i_{2}} \in {CC}_{x_{1}}^{i_{1}}}{C_{x_{1},x_{2}}^{i_{1},i_{2}}V_{x_{2},{k - 2}}^{i_{2}}}}} \right)} \right\rbrack}}},}} & (10) \end{matrix}$

-   -   and where tree T^(i) ¹ belongs to the set of neighbor trees of         T^(i); T^(i2) belongs to the set of neighbor trees of T^(i) ¹ .         These terms V_(RC) _(j,k) ^(i), V_(LC) _(j,k) ^(i), and V_(MC)         _(j,k) ^(i) have the following physical interpretations. The         first term V_(RC) _(j,k) ^(i) is exactly equal to that in         coupled RC trees. The second and third terms, V_(LC) _(j,k) ^(i)         and V_(MC) _(j,k) ^(i), represent the contributions to moment         V_(j,k) ^(i) from self inductances and mutual inductances on         path P_(j) ^(i), respectively. It is worthy of mentioning that         the kth-order voltage moment only depends on the (k−1)st- and         (k−2)nd-order ones. The Elmore delay at n_(j) ^(i) can be         calculated as −V_(j,1) ^(i)=Σ_(n) _(p) _(i) _(εn) _(i) R_(pj)         ^(i)C_(pT) ^(i), if T^(i) is an aggressor tree and n_(j) ^(i) is         not the root of T^(i). Self inductances and mutual inductances         in coupled RLC trees will not affect the Elmore delay.

Now the invention considers the rules of the signs of the voltage moments for coupled RLC trees. As indicated in Q. Yu and E. S. Kuh, “Moment computation of lumped and distributed coupled RC trees with application to delay and crosstalk estimation,” Proceedings of the IEEE, vol. 89, no. 5, pp. 772-788, 2001, the sign of V_(j,k) ^(i) for coupled RC trees can be determined by that of V_(j,k−1) ^(i) and the directions of current moments through coupling capacitances. However, the signs of voltage moments for the coupled RLC-tree models will be more complex than those for coupled RC-tree models. That is, V_(j,k−1) ^(i) in Eq. (10) may depend not only on V_(j,k−1) ^(i) but also on V_(j,k−2) ^(i) and self/mutual inductances. The inductive components, i.e., V_(LC) _(j,k) ^(i) and V_(MC) _(j,k) ^(i) in Eq. (10), will alter the original sign rules. From Eq. (10), it can be observed that if V_(j,k) ^(i) does not exist or V_(j,k) ^(i)=0, the magnitude of V_(j,k) ^(i) for coupled RLC trees is equal to that for coupled RC trees. Extending the observations, we represent the following proposition:

Proposition 1: For any node on coupled RLC trees, the signs of the voltage moments have the following relationships:

-   -   1. V_(j,0) ¹=1 and V_(j,1) ¹<0 for any node n_(j) ¹ on the         aggressor tree T¹; and     -   2. V_(j,k) ^(i)=0 for k<d_(i), and V_(j,d) _(i) ^(i)>0 for any         node n_(j) ^(i) on the victim tree T^(i) with depth d_(i)>0.

The proposition will be applied to analyze the stability of the reduced-order models of coupled RLC trees.

Stability of reduced-order models can not be guaranteed for general RLC circuits, even for the simplest models (i.e., one-pole model and two-pole model). For example, an one-pole model (see A. Vittal, L. H. Chen, M. Marek-Sadowska, K. P. Wang, and S. Yang, “Crosstalk in VLSI interconnects,” IEEE Trans. Computer-Aided Design, vol. 18, pp. 1817-1824, 1999) can be represented as follows: ${\hat{V}(s)} = {\frac{a_{0}}{1 + {b_{1}s}} = {V_{1} + {V_{2}{s.}}}}$

After simple manipulations, we have a₀=V₁, b₁=−V₂/V₁, and the pole is p₁=V₁/V₂. From Proposition 1, we have known that V₁ is positive but V₂ may be nonnegative due to significant inductive effects. Thus the one-pole model may be unstable.

We will derive recursive formulas for computing the kth-order moment at node n_(j) ^(i) from the kth-order moment at the corresponding node F(n_(j) ^(i)). The recursive processes will be proceeded by calculating both current moments I_(j,k) ^(i) and voltage moments V_(j,k) ^(i) recursively. First, by accumulating capacitive current sources at each level of {circumflex over (D)}(n_(j) ^(i)), the set of descendant nodes of n_(j) ^(i), Eq. (6) can be rewritten $\begin{matrix} {I_{j,k}^{i} = {I_{C_{j,k}}^{i} + {\sum\limits_{n_{x}^{i} \in {S{(n_{l}^{i})}}}{I_{x,k}^{i}.}}}} & (11) \end{matrix}$

Thus each kth-order current moment can be calculated upstream from leaves of the coupled RLC trees to their roots by using the (k−1)st-order voltage moments in Eq. (5).

Similarly, the kth-order moment V_(j,k) ^(i) can be derived from Eq. (7) $\begin{matrix} \begin{matrix} {{V_{j,k}^{i} = {V_{{F{(j)}},k}^{i} - {R_{j}^{i}I_{j,k}^{i}} - {L_{j}^{i}I_{j,{k - 1}}^{i}} - {\underset{M_{j,j_{1}}^{i,i_{1}} \in {MM}_{j}^{i}}{\sum\quad}M_{j,j_{1}}^{i,i_{1}}I_{j_{1},{k - 1}}^{i_{1}}}}},} \\ {\quad{= {V_{C_{j,k}^{i}} - V_{{LM}_{{j,k}\quad}^{i}}}}\quad} \end{matrix} & (12) \end{matrix}$

-   -   where V_(C) _(j,k) ^(i)=V_(F(j),k) ^(i)−R_(j) ^(i)I_(j,k) ^(i)         represents the original computations of V_(j,k) ^(i) in coupled         RC trees;         $V_{{LM}_{j,k}}^{i} = {{L_{j}^{i}I_{j,{k - 1}}^{i}} + {\underset{M_{j,j_{1}}^{i,i_{1}} \in {MM}_{j}^{i}}{\sum\quad}M_{j,j_{1}}^{i,i_{1}}I_{j_{1},{k - 1}}^{i_{1}}}}$         indicates contributions of self inductances and mutual         inductances on V_(j,k) ^(i), respectively. In comparison with         the formulas of coupled RC and RLC trees, it can be concluded         that the kth-order moment V_(j,k) ^(i) depends not only on the         kth-order moment I_(j,k) ^(i) but on the (k−1)st-order moments         I_(j,k−1) ^(i) and I_(j) ₁ _(,k−1) ^(i) ¹ . Eq. (12) indicates         that each kth-order voltage moments can be calculated downstream         from the roots of the coupled RLC trees to their leaves if all         the kth-and (k−1)st-order current moments are solved.

As shown FIG. 5, Algorithm 1 embodied in Eqs. (5), (11), and (12) is the recursive moment computation algorithm. The main function MomCom contains three sub-functions ZerothOrderMom, Current, and Voltage_(LM). We extend the algorithm for coupled RC trees disclosed in Q. Yu and E. S. Kuh, “Moment computation of lumped and distributed coupled RC trees with application to delay and crosstalk estimation,” Proceedings of the IEEE, vol. 89, no. 5, pp. 772-788, 2001, with considering both self inductive effects and mutual inductive effects. Only the function Voltage_(LM) is needed to be modified in calculating the term V_(LM) _(j,k) ^(i). The computational complexity of the algorithm with considering of RC circuits is equal to O(nk), where n is the number of nodes in the circuit and k represents the maximum order. Since incorporating floating self and mutual inductances do not change the number of nodes, Algorithm 1 still retains the linear order computational complexity.

Crosstalk Noise Estimations for Coupled RLC Trees

The purpose of crosstalk estimations is to solve the peak voltage value at the far end node in the victim tree efficiently and accurately. As interconnects are typically of very large size and high-order, model-order reduction is a necessity for efficient crosstalk estimations. In this section, we will utilize moment matching techniques to establish a reduced-order system first. Then we will use the reduced-order system to estimate the crosstalk metric.

In order to overcome the stability issue of the qth-order reduced-order model, here the projection-based model-order reduction algorithms are recommended. A guaranteed stable reduced-order model will be generated for crosstalk noise estimations. By applying the congruence transformation, the original n-dimensional state vector can be projected to a reduced q-dimensional one, where q<<n.

Step 18 aims to establish a stable reduced-order model ({circumflex over (N)}+s{circumflex over (M)}){circumflex over (X)}(s)={circumflex over (B)}.

The congruence transformation Q is used to project the n-dimensional original state vector to a reduced-order q-dimensional one: {circumflex over (X)}=Q^(T)X. Thus, we have the following MNA matrices for the reduced-order model: {circumflex over (N)}=Q ^(T) NQ, {circumflex over (M)}=Q ^(T) MQ, {circumflex over (B)}=Q ^(T) B and {circumflex over (P)}=Q ^(T) P where {circumflex over (M)},{circumflex over (N)}εR^(q×q) and {circumflex over (X)},{circumflex over (B)},{circumflex over (P)},εR^(q). {circumflex over (X)}_(i), the ith-order moment of the reduced-order network {circumflex over (X)}(s), can also be defined. The conventional moment matching technique implies that if each moment {circumflex over (X)}_(i) lies in the column space of Q, the first q moments of {circumflex over (X)}(s) will indeed be equal to those of X(s), as disclosed in J. M. Wang, C. C. Chu, Q. Yu, and E. S. Kuh, “On projection-based algorithms for model-order reduction of interconnects,” IEEE Trans. Circuits Syst. I, vol. 49, no. 11, pp. 1563-1585, 2002. That is, {circumflex over (X)}_(i)={circumflex over (X)}_(i) for i=0, 1, . . . , q−1. In particular, if each column Q_(i) in Q is equal to the system moment X_(i−1) (i.e., Q=└X₀ X₁ . . . X_(q−1)┘), each entry of {circumflex over (M)} and {circumflex over (N)} can be described as follows: {circumflex over (m)} _(ij) =X _(i−1) ^(T) MX _(j−1) and {circumflex over (n)}_(ij) =X _(i−1) ^(T) NX _(j−1).  (13)

Entries of {circumflex over (M)} and {circumflex over (N)} have subtle relationships, which are summarized in the following proposition.

Proposition 2: Let matrices {circumflex over (M)} and {circumflex over (N)} be the MNA matrices for the reduced-order model that are generated by the congruence transformation Q, where Q=└X₀ X₁ . . . X_(q−1)┘. Thus entries of {circumflex over (M)} and {circumflex over (N)} have the following subtle relationships: 1. {circumflex over (m)}_(ij)=−X_(i−1) ^(T)NX_(j)={circumflex over (n)}_(i,j+1) and 2. m_(ij=X) _(j−1) ^(T)MX_(i−1)=−X_(j−1) ^(T)NX_(i)=−{circumflex over (n)}_(j,i+1).

Therefore, except for {circumflex over (m)}_(kk), all other entries of {circumflex over (M)} can be obtained directly from {circumflex over (N)}. The remaining task is to calculate each entry in {circumflex over (N)} and the entry {circumflex over (m)}_(kk). By exploring symmetric characteristics of matrix M, the entry {circumflex over (n)}_(ij) can be calculated by using Eq. (2). Suppose that X_(j−2)=[V_(j−2) ^(T) I_(j−2) ^(T)]^(T) and MX_(j−2)=[V_(j−2) ^(T)C I_(j−2) ^(T)L]^(T), where vector V_(j−2) and vector I_(j−2) are the (j−2)nd-order moment of V(s) and I(s). CV_(j−2) and LI_(j−2) can be calculated easily. For general cases, it can be derived that CV_(j − 2) = ⌊I_(C_(x, j − 1))⌋_(x = 1)^(t/2)  and  LI_(j − 2) = ⌊V_(LM_(x, j − 2))⌋_(x = 1)^(t/2). It is worthy of mentioning that these moments are intermediates in Algorithm 1 without any additional costs. Therefore, all entries in {circumflex over (N)} and {circumflex over (m)}_(kk) can be calculated by multiplying the corresponding moment vectors rather than constructing M and N explicitly.

Further simplifications about entries in the matrix {circumflex over (N)} are still possible. The following proposition presents this result.

Proposition 3: With the same conditions as Proposition 2, entries in the first column and the first row of matrices {circumflex over (N)} have the relationships shown as below:

-   -   1. {circumflex over (n)}₁₁=0     -   2. {circumflex over (n)}_(i1) (i>1), denoted as I_(1,i−1) ^(a),         is equal to the (i−1)st-order moment of the current entering         node n₁ ^(a) in the aggressor tree T^(a); and     -   3. {circumflex over (n)}_(1i)=−{circumflex over (n)}_(i1).

By exploring symmetric characteristic of matrix M, it is straightforward to see that entries in matrix {circumflex over (N)} can also be related as follows: $\begin{matrix} {{\hat{n}}_{ij} = {{- X_{i - 1}^{T}}{MX}_{j - 2}}} \\ {= {{- X_{j - 2}^{T}}{MX}_{i - 1}}} \\ {= {{{\hat{n}}_{{j - 1},{i + 1}}\quad{for}\quad i} \geq {2\quad{and}\quad j} \geq {i + 2.}}} \end{matrix}$

For illustrational purpose, let symbol ◯ represent the entries of matrix {circumflex over (N)} that need to be calculated additionally using Algorithm 1, and symbol X denote the entries of matrix {circumflex over (N)} that can be simplified by Proposition 3 and Corollary 1. Entries in {circumflex over (N)} can be displayed as follows: $\begin{bmatrix} X & X & X & X & X & X & \cdots & X \\ ◯ & ◯ & ◯ & X & X & X & \cdots & X \\ ◯ & ◯ & ◯ & ◯ & X & X & \cdots & X \\ ◯ & ◯ & ◯ & ◯ & ◯ & X & \cdots & X \\ ◯ & ◯ & ◯ & ◯ & ◯ & ◯ & ⋰ & X \\ ◯ & ◯ & ◯ & ◯ & ◯ & ◯ & ⋰ & X \\ \vdots & \vdots & \vdots & \vdots & \vdots & \vdots & \vdots & \quad \\ ◯ & ◯ & ◯ & ◯ & ◯ & ◯ & ⋰ & X \\ ◯ & ◯ & ◯ & ◯ & ◯ & ◯ & \cdots & ◯ \\ ◯ & ◯ & ◯ & ◯ & ◯ & ◯ & \cdots & ◯ \end{bmatrix}.$

Thus the number of entries that need to be calculated in a q×q matrix {circumflex over (N)} can be counted as follows: $\begin{matrix} \left\{ \begin{matrix} {0,} & {{{{if}\quad q} = 1},} \\ {2,} & {{{{if}\quad q} = 2},} \\ {{{\frac{1}{2}\left( {{2q} + 1} \right)\left( {q - 1} \right)} - 1},} & {{{if}\quad q} \geq 3.} \end{matrix} \right. & (17) \end{matrix}$

Let V(s) and {circumflex over (V)}(s) be the step responses of the original model and the desired reduced-order model, respectively. Technique disclosed in M. Kuhlmann and S. S. Sapatnekar, “Exact and efficient crosstalk estimation,” IEEE Trans. Computer-Aided Design, vol. 20, no. 7, pp. 858-866, 2001, suggested an appropriate formula of the q-pole reduced-order model {circumflex over (V)}(s) as follows (as in step 24): $\begin{matrix} {{{\hat{V}(s)} = \frac{a_{0} + {a_{1}s} + \ldots + {a_{q - 2}s^{q - 1}}}{1 + {b_{1}s} + \ldots + {b_{q - 1}s^{q - 1}} + {b_{q}s^{q}}}},} & (14) \end{matrix}$ which causes the approximate crosstalk voltage {circumflex over (v)}(t) to be zero for t converging to 0 and ∞. Conventional moment matching techniques are often used to solve the unknown coefficients a_(i)(0≦i≦q−2) and b_(j)(1≦j≦q) by using the front 2q−1 moments {V₁, V₂, . . . , V_(2q−1)} of the original model: V(s)=V ₁ +V ₂ s+V ₃ s ² + . . . +V _(2q−1)s^(2q−2)+ . . . ,

In step 26, Eq. (14) can also be rewritten as the pole-residue form $\begin{matrix} {{{\hat{V}(s)} = {\frac{k_{1}}{s - p_{1}} + \frac{k_{2}}{s - p_{2}} + \ldots + \frac{k_{q}}{s - p_{q}}}},} & (15) \end{matrix}$ where p_(i) for i=1, 2, . . . , q are poles of {circumflex over (V)}(s) and each k_(i) is the residue corresponding to the pole p_(i). By applying the inverse Laplace transformation, we have {circumflex over (v)}(t)=k ₁ e ^(p) ¹ ^(t) +k ₂ e ^(p) ² ^(t) + . . . +k _(q) e ^(p) ^(q) ^(t).

In step 28, the peak value of the crosstalk waveform will occur at time t=t_(m) where {circumflex over (v)}′(t_(m))=0 and {circumflex over (v)}^(n)(t_(m))<0.

In the previous moment computations, the input waveform is assumed to be a step function. However, the input signal in step 10 may be with an arbitrary waveform. Let the updated V(s) be V(s)=m ₁ ′s+m ₂ ′s ² +m ₃ ′s ³ +m ₄ ′s ⁴ +m ₅ ′s ⁵ . . . .  (16)

For example, suppose that the input signal is a ramp function as follows: v(t)=t/τu(t)−t/τu(t−τ)+u(t−τ), where u(t) is a step function and 1/τ is the slope of the ramp function.

Applying the Laplace transform, we have $\begin{matrix} {{V(s)} = {\frac{1}{s}{\left( {1 - {\frac{\tau}{2}s} + {\frac{\tau^{2}}{6}s^{2}} - {\frac{\tau^{3}}{24}s^{3}} + {\frac{\tau^{4}}{120}s^{4}} + \ldots} \right).}}} & (17) \end{matrix}$

Comparing the coefficients of Eqs. (16) and (17) concludes $\begin{matrix} {m_{1}^{\prime} = m_{1}} \\ {m_{2}^{\prime} = {m_{2} - {\frac{\tau}{2}m_{1}}}} \\ {m_{3}^{\prime} = {m_{3} - {\frac{\tau}{2}m_{2}} + {\frac{\tau^{2}}{6}m_{1}}}} \\ {m_{4}^{\prime} = {m_{4} - {\frac{\tau}{2}m_{3}} + {\frac{\tau^{2}}{6}m_{2}} - {\frac{\tau^{3}}{24}m_{1}}}} \\ {m_{5}^{\prime} = {m_{5} - {\frac{\tau}{2}m_{4}} + {\frac{\tau^{2}}{6}m_{3}} - {\frac{\tau^{3}}{24}m_{2}} + {\frac{\tau^{4}}{120}m_{1}}}} \\ \vdots \end{matrix}$

ILLUSTRATIVE EXAMPLES

To verify the accuracy of the proposed method, three coupling circuits but not limiting examples shown in FIG. 6 are studied for crosstalk estimations. The squares represent the roots of the trees and and the circles stand for the leaves of the trees for crosstalk estimations. Among all circuits, the line parameters are resistance: 35 Ω/cm, grounding capacitance: 5.16 pF/cm, self inductance: 3.47 nH/cm, coupling capacitance: 6 pF/cm, and mutual inductance: 1 nH/cm. The wire resistance, capacitance and inductance are distributed per 100 μm. The loading of each line is 50 fF. We examine peak values of noises and peak noise occurring time for the cases with different circuit topologies, line lengths, coupling locations, effective driver impedances, and rising times. For the circuits in FIG. 6, the lengths of the coupling line of net 1 belong to the set L1={1, 2, 3, 4, 5} (mm) and those of net 2 are also in the set L2={1, 2, 3, 4, 5} (mm) that are never longer than the lengths of net 1. Other branches in FIGS. 6(b)(c) are all 1 mm. The topology of each net 1 is fixed. Each net 2 changes the coupling locations and shifts 1 mm each time from alignment at the near end of net 1 to that at the far end of net 1. In each case, net 1 and net 2 are excited independently. Thus there are total 65 cases for the two-line circuit and 70 cases for the tree 1 and tree 2 circuits. In addition, four effective driver impedance pairs: 3 Ω-3 Ω, 3 Ω-30 Ω, 30 Ω-3 Ω and 30 Ω-30 Ω, which are connected to the near ends of the two nets, are examined. The voltage source connected to the aggressor net is a ramp function with two rising time 0.02 ns and 0.2 ns and with a normalized unit magnitude. Thus, we have total 1640 cases to examine accuracy of the proposed method.

The conventional one-pole model (1P) and two-pole model (2P) and our new method with three-pole model (S3P), four-pole model (S4P), . . . , eight-pole model (S8P) are investigated for comparison studies. Absolute and relative errors of crosstalk peak values in comparison with HSPICE simulation results are summarized in Tables 1 and 2. The corresponding absolute relative errors of crosstalk noise peak value occurrence time are summarized in Tables 3 and 4. Each entry from row 1 to row 24 represents the average error of the cases for different lengths of net 1 and net 2 under a condition of a specific rising time and driver impedance. The entries in the last three rows of each model stand for the maximum, average, and minimum error of the 24 sets in the table. Among 1640 cases, there are 42 cases in which model 1P has unstable poles and 18 cases in which model 2P is unstable. From simulation results, we have the following observations:

1. The models generated by our method perform better than the conventional 1P and 2P models. Thus these conventional models are no longer appropriated for coupled RLC trees. With increasing order of reduced-order moldels, the proposed models perform more accurately.

2. From the viewpoints of the absolute error values in Tables 1 and 3, model S3P, whose average errors are smaller than 10%, seems acceptable to crosstalk noise estimations. However, referring to the relative error values in Tables 2 and 4, model S3P seems not accurate as expected. For balancing computational efficiency and estimation performance, the S6P model will be recommended.

3. With increasing the effective driver impedance and rising time, errors of each model seem decreasing.

Although the invention has been explained in relation to its preferred embodiment, it is to be understood that many other possible modifications and variations can be made without departing from the spirit and scope of the invention as hereinafter claimed. 

1. A method of estimating crosstalk noise in RLC coupled interconnects, wherein the recursive moment computation is defined by ${I_{C_{j,k}}^{i} = {{C_{jT}^{i}V_{j,{k - 1}}^{i}} - {\sum\limits_{C_{j,j_{1}}^{i,i_{1}} \in {CC}_{j}^{i}}{C_{j,j_{1}}^{i,i_{1}}V_{j_{1},{k - 1}}^{i_{1}}}}}};$ ${I_{j,k}^{i} = {I_{C_{j,k}}^{i} + {\sum\limits_{n_{x}^{i} \in {S{(n_{j}^{i})}}}I_{x,k}^{i}}}};{and}$ ${{V_{j,k}^{i} = {V_{{F{(j)}},k}^{i} - {R_{j}^{i}I_{j,k}^{i}} - {L_{j}^{i}I_{j,{k - 1}}^{i}} - {\sum\limits_{M_{j,j_{1}}^{i,i_{1}} \in {MM}_{j}^{i}}{M_{j,j_{1}}^{i,i_{1}}I_{j_{1},{k - 1}}^{i_{1}}}}}},\quad{= {V_{C_{j,k}}^{i} - V_{{LM}_{j,k}}^{i}}}}\quad$ where V_(C) _(j,k) ^(i)=V_(F(j),k) ^(i)−R_(j) ^(i)I_(j,k) ^(i) represents the original computations of V_(j,k) ^(i) in coupled RC trees; $V_{{LM}_{j,k}}^{i} = {{L_{j}^{i}I_{j,{k - 1}}^{i}} + {\sum\limits_{M_{j,j_{1}}^{i,i_{1}} \in {MM}_{j}^{i}}{M_{j,j_{1}}^{i,i_{1}}I_{j_{1},{k - 1}}^{i_{1}}}}}$ indicates contributions of self inductances and mutual inductances on V_(j,k) ^(i), and where A. i represents tree T^(i); B. n_(j) ^(i) is the jth node in the tree T^(i); C. F(n_(j) ^(i)) is the corresponding father node of n_(j) ^(i); D. N^(i) is the set of the non-root nodes in T^(i); E. S(n_(j) ^(i)) denotes the set of the son nodes of n_(j) ^(i); F. R_(j) ^(i) and L_(j) ^(i) are the resistance and the inductance connected between n_(j) ^(i) and F(n_(j) ^(i)); G. C_(j,0) ^(i) is the capacitance connected between n_(j) ^(i) and the ground; H. C_(j, j₁)^(i, i₁)  denotes the coupling capacitance between n_(j) ^(i) and n_(j) ₁ ^(i) ¹ ; I. M_(j, j₁)^(i, i₁)  is the mutual inductance between L_(j) ^(i) and L_(j) ₁ ^(i) ¹ ; J. CC_(j) ^(i) denotes the set of coupling capacitances connected to n_(j) ^(i); K. MM_(j) ^(i) is the set of mutual inductances coupled to L_(j) ^(i); L. P_(jk) ^(i) is defined as the common path of the path P_(j) ^(i) from n_(j) ^(i) to the root of T^(i) and of the path P_(k) ^(i) from n_(k) ^(i) to the root of T^(i); M. R_(jk) ^(i) and L_(jk) ^(i) are the total resistance and the total inductance along the path P_(jk) ^(i), defined as the sum of the resistances and the sum of the self inductances along the path P_(jk) ^(i), that is, ${R_{jk}^{i} = {{\sum\limits_{n_{j}^{i} \in P_{jk}^{i}}{R_{j}^{i}\quad{and}\quad L_{jk}^{i}}} = {\sum\limits_{n_{j}^{i} \in P_{jk}^{i}}L_{j}^{i}}}};$ N. C_(jT) ^(i) is the total capacitance at the node n_(j) ^(i), defined as the sum of capacitances connected to the node n_(j) ^(i), that is, ${C_{jT}^{i} = {C_{j,0}^{i} + {\sum\limits_{C_{j,{j1}}^{i,{i1}} \in {CC}_{j}^{i}}C_{j,j_{1}}^{i,i_{1}}}}};$ O. A(n_(j) ^(i)) is the set of ancestor nodes of n_(j) ^(i), covering the nodes on the path P_(F(j)) ^(i) from F(n_(j) ^(i)) to the root of T^(i); P. Â(n_(j) ^(i))={{A(n_(j) ^(i))−n₀ ^(i)}∪n_(j) ^(i)}; Q. D(n_(j) ^(i))={n_(x) ^(i)|n_(j) ^(i)εA(n_(x) ^(i))} denotes the set of descendant nodes of n_(j) ^(i); R. {circumflex over (D)}(n_(j) ^(i))={n_(j) ^(i)∪D(n_(j) ^(i))}; S. V_(j) ^(i)(s) is the transfer function of the voltage at node n_(j) ^(i); T. I_(j) ^(i)(s) be the one of the current flowing through R_(j) ^(i); U. V_(j,k) ^(i) is called the kth-order voltage moment of V_(j) ^(i)(s); and V. I_(j,k) ^(i) is called the kth-order current moment of I_(j) ^(i)(s).
 2. The method as claimed in claim 1, wherein the analytical formula for voltage moments at each node is defined by V_(j, k)^(i) = V_(RC_(j, k))^(i) + V_(LC_(j, k))^(i) + V_(MC_(j, k))^(i), where $V_{{RC}_{j,k}}^{i} = {{- \underset{n_{p}^{i} \in N^{i}}{\sum\quad}}{R_{pj}^{i}\left( {{C_{pT}^{i}V_{p,{k - 1}}^{i}} - {\sum\limits_{C_{p,p_{1}}^{i,i_{1}} \in {CC}_{p}^{i}}{C_{p,p_{1}}^{i,i_{1}}V_{p_{1},{k - 1}}^{i_{1}}}}} \right)}}$ $V_{{LC}_{j,k}}^{i} = {{- \underset{n_{p}^{i} \in N^{i}}{\sum\quad}}{L_{pj}^{i}\left( {{C_{pT}^{i}V_{p,{k - 2}}^{i}} - {\sum\limits_{C_{p,p_{1}}^{i,i_{1}} \in {CC}_{p}^{i}}{C_{p,p_{1}}^{i,i_{1}}V_{p_{1},{k - 2}}^{i_{1}}}}} \right)}}$ $V_{{MC}_{j,k}}^{i} = {- {\underset{n_{r}^{i} \in {A{(n_{j}^{i})}}}{\sum\quad}{\underset{M_{r,r_{1}}^{i,i_{1}} \in {MM}_{r}^{i}}{\sum\quad}{{M_{r,r_{1}}^{i,i_{1}}\left\lbrack {\underset{n_{x_{1}}^{i_{1}} \in {D{(n_{r_{1}}^{i_{1}})}}}{\sum\quad}\left( {{C_{x_{1}T}^{i_{1}}V_{x_{1},{k - 2}}^{i_{1}}} - {\sum\limits_{C_{x_{1},x_{2}}^{i_{1},i_{2}} \in {CC}_{x_{1}}^{i_{1}}}{C_{x_{1},x_{2}}^{i_{1},i_{2}}V_{x_{2},{k - 2}}^{i_{2}}}}} \right)} \right\rbrack}.}}}}$
 3. The method as claimed in claim 1, wherein the entries of {circumflex over (M)} and {circumflex over (N)} have the following subtle relationships: A. {circumflex over (m)} _(ij) =−X _(i−1) ^(T) NX _(k) ≈−{circumflex over (n)} _(i,j+1); and B. m _(ij) =X _(j−1) ^(T) MX _(i−1) =−X _(j−1) ^(T) NX _(i) =−{circumflex over (n)} _(j,i+1), where {circumflex over (M)} and {circumflex over (N)} are the corresponding MNA matrices of the crosstalk estimation models; {circumflex over (m)}_(ij) and {circumflex over (n)}_(ij) represent the ith-row and jth-column entries of {circumflex over (M)} and {circumflex over (N)}, respectively; except for {circumflex over (m)}_(kk), all other entries of {circumflex over (M)} can be obtained directly from {circumflex over (N)}; all entries in {circumflex over (N)} and {circumflex over (m)}_(kk) can be calculated by multiplying the corresponding moment vectors rather than constructing the MNA matrices of the original model, M and N, explicitly.
 4. The method as claimed in claim 1, wherein the entries in the first column and the first row of matrices {circumflex over (N)} are defined by A. {circumflex over (n)}₁₁=0, which is the first-row and first-column entry; B. {circumflex over (n)}_(i1) (i>1), the first-column entries, are equal to the (i−1)st-order moment of the current I_(1,i−1) ^(a) entering node n₁ ^(a) in the aggressor tree T^(a); C. {circumflex over (n)}_(1i)=−{circumflex over (n)}_(i1) are the first-row entries; and D. other entries {circumflex over (n)}_(ij)=−X_(i−1) ^(T)MX_(j−2), where M, a real n×n matrix, is the MNA matrix containing capacitors and inductors; X_(i−1), a real n×1 vector, contains the (i−1)st circuit moments of all grounding nodes and all resistor-inductor branches, and MX_(j−2)=└I_(C) _(x,j−1) V_(LM) _(x,j−2) ┘ for x=1, 2, . . . , n/2; by exploring symmetric characteristic of matrix M, it is straightforward to see that entries in matrix {circumflex over (N)} can also be related as follows: $\begin{matrix} {{\hat{n}}_{ij} = {{- X_{i - 1}^{T}}{MX}_{j - 2}}} \\ {= {{- X_{j - 2}^{T}}{MX}_{i - 1}}} \\ {{= {{{\hat{n}}_{{j - 1},{i + 1}}\quad{for}\quad i} \geq {2\quad{and}\quad j} \geq {i + 2}}};} \end{matrix}$ for illustrational purpose, let symbol ◯ represent the entries of matrix {circumflex over (N)} that need to be calculated additionally using the method in claim 1, and symbol X denote the entries of matrix {circumflex over (N)} that can be simplified as shown in claim 4; entries in {circumflex over (N)} can be displayed as follows: $\begin{bmatrix} X & X & X & X & X & X & \ldots & X \\ ◯ & ◯ & ◯ & X & X & X & \ldots & X \\ ◯ & ◯ & ◯ & ◯ & X & X & \ldots & X \\ ◯ & ◯ & ◯ & ◯ & ◯ & X & \ldots & X \\ ◯ & ◯ & ◯ & ◯ & ◯ & ◯ & ⋰ & X \\ ◯ & ◯ & ◯ & ◯ & ◯ & ◯ & ⋰ & X \\ \vdots & \vdots & \vdots & \vdots & \vdots & \vdots & \vdots & \quad \\ ◯ & ◯ & ◯ & ◯ & ◯ & ◯ & ⋰ & X \\ ◯ & ◯ & ◯ & ◯ & ◯ & ◯ & \ldots & ◯ \\ ◯ & ◯ & ◯ & ◯ & ◯ & ◯ & \ldots & ◯ \end{bmatrix};$ thus the number of entries ◯ that need to be calculated in a q×q matrix {circumflex over (N)} can be counted as follows: $\left\{ {\quad\begin{matrix} {0,} & {{{{if}\quad q} = 1},} \\ {2,} & {{{{if}\quad q} = 2},} \\ {{{\frac{1}{2}\left( {{2q} + 1} \right)\left( {q - 1} \right)} - 1},} & {{{if}\quad q} \geq 3.} \end{matrix}} \right.$ 